Sojourn times in a processor sharing queue with multiple vacations
نویسندگان
چکیده
منابع مشابه
Sojourn times in a processor sharing queue with multiple vacations
We study an M/G/1 processor sharing queue with multiple vacations. The server only takes a vacation when the system has become empty. If he finds the system still empty upon return, he takes another vacation, and so on. Successive vacations are identically distributed, with a general distribution. When the service requirements are exponentially distributed we determine the sojourn time distribu...
متن کاملSojourn times in a processor sharing queue with service interruptions
We study the sojourn time of customers in an M/M/1 queue with processor sharing service discipline and service interruptions. The lengths of the service interruptions have a general distribution, whereas the periods of service availability are assumed to have an exponential distribution. A branching process approach is shown to lead to a decomposition of the sojourn time into independent contri...
متن کاملSojourn Times in the M/PH/1 Processor Sharing Queue
We give in this paper an algorithm to compute the sojourn time distribution in the processor sharing, single server queue with Poisson arrivals and phase type distributed service times. In a first step, we establish the differential system governing the conditional sojourn times probability distributions in this queue, given the number of customers in the different phases of the PH distribution...
متن کاملOn sojourn times in the finite capacity M/M/1 queue with processor sharing
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. We give an exact expression for the sojourn time distribution in the finite capacity model, in terms of a Laplace transform. We then give the tail behavior, for the limit K → ∞, by locating the dominant singularity of the Laplace transform. keywords: finite capacity, processor sharing, sojour...
متن کاملSojourn Times in Non-Homogeneous QBD Processes with Processor Sharing
We study sojourn times of customers in a processor sharing model with a service rate that varies over time, depending on the number of customers and on the state of a random environment. An explicit expression is derived for the Laplace-Stieltjes transform of the sojourn time conditional on the state upon arrival and the amount of work brought into the system. Particular attention is given to t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Queueing Systems
سال: 2012
ISSN: 0257-0130,1572-9443
DOI: 10.1007/s11134-012-9277-y